Edge coloring

Results: 250



#Item
21Weak Sense of Direction Labelings and Graph Embeddings Christine T. Cheng∗ Ichiro Suzuki†  December 27, 2010

Weak Sense of Direction Labelings and Graph Embeddings Christine T. Cheng∗ Ichiro Suzuki† December 27, 2010

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2010-12-27 12:34:40
22Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen  Fan Chung

Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen Fan Chung

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2005-02-25 13:23:11
23Short proofs of coloring theorems on planar graphs Oleg V. Borodin∗ Alexandr V. Kostochka† Bernard Lidick´ y‡

Short proofs of coloring theorems on planar graphs Oleg V. Borodin∗ Alexandr V. Kostochka† Bernard Lidick´ y‡

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:53
24Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer

Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
25SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

SIAM J. DISCRETE MATH. Vol. 25, No. 4, pp. 1746–1753 c 2011 Society for Industrial and Applied Mathematics 

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:12
26List coloring and crossings ˇ Dvoˇrák, Bernard Lidický and Riste Škrekovski Zdenek Charles University University of Ljubljana

List coloring and crossings ˇ Dvoˇrák, Bernard Lidický and Riste Škrekovski Zdenek Charles University University of Ljubljana

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:59
27M:�RA�35_31FINIT�CE	IALA	IALA.dvi

M:RA35_31FINITCE IALA IALA.dvi

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2007-12-02 16:52:35
28Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2015-01-20 10:45:26
29Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1  2

Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2013-04-23 04:28:57
30coloring triangle-free planar graphs with a precolored 9-cycle

coloring triangle-free planar graphs with a precolored 9-cycle

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-01-29 17:07:54